全文获取类型
收费全文 | 1133篇 |
免费 | 22篇 |
出版年
2021年 | 13篇 |
2020年 | 10篇 |
2019年 | 24篇 |
2017年 | 31篇 |
2016年 | 22篇 |
2015年 | 23篇 |
2014年 | 28篇 |
2013年 | 208篇 |
2012年 | 28篇 |
2011年 | 30篇 |
2010年 | 33篇 |
2009年 | 27篇 |
2008年 | 34篇 |
2007年 | 20篇 |
2006年 | 25篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 19篇 |
1991年 | 11篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1986年 | 32篇 |
1985年 | 24篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 20篇 |
1978年 | 18篇 |
1977年 | 12篇 |
1976年 | 17篇 |
1975年 | 16篇 |
1974年 | 14篇 |
1973年 | 10篇 |
1972年 | 24篇 |
1971年 | 15篇 |
1970年 | 14篇 |
1969年 | 15篇 |
1968年 | 13篇 |
1967年 | 11篇 |
1966年 | 10篇 |
排序方式: 共有1155条查询结果,搜索用时 14 毫秒
101.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
102.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
103.
Least squares estimators of the parameters of the generalized Eyring Model are obtained by using data from censored life tests conducted at several accelerated environments. These estimators are obtained after establishing that the Gauss-Markov conditions for least squares estimation are satisfied. Confidence intervals for the hazard rate at use conditions are obtained after empirically showing that the logarithm of the estimate of the hazard rate at use conditions is approximately normally distributed. The coverage probabilities of the confidence intervals are also verified by a Monte Carlo experiment. The techniques are illustrated by an application to some real data. 相似文献
104.
A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included. 相似文献
105.
This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph-theoretic approach is utilized to define the basis as a one-forest consisting of one-trees (a tree with an extra edge). Algorithmic development of the pivot-step is presented by the representation of a two-tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper. 相似文献
106.
The calculation of the exact reliability of complex systems is a difficult and tedious task. Consequently simple approximating techniques have great practical value. The hazard transform of a system is an invertible transformation of its reliability function which is convenient and useful in both applied and theoretical reliability work. A simple calculus for finding an approximate hazard transform for systems formed by series and parallel combinations of components is extended so that it can be used for any coherent system. The extended calculus is shown to lead to conservative approximations. A first order version of the extended calculus is also discussed. This method of approximation is even more simple to use, but is not always conservative. Examples of its application indicate that it is capable of giving quite accurate results. 相似文献
107.
Alan J. Kaplan 《海军后勤学研究》1973,20(2):231-239
Multi-depot supply systems are subject to stock distribution imbalances; i. e., the fraction of total system stock located at a depot may be too small to support the fraction of system demand expected to be placed on it. In the supply system of concern, a cutomer is always satisfied if there is stock anywhere in the system. Stock redistributions to correct imbalances may reduce both transportation costs and customer waiting times. A model for determining optimum redistribution quantities is formulated, and a practical method of solution for the two depot case is described. Selected numerical illustrations are given. 相似文献
108.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved. 相似文献
109.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献
110.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献